Optimal Solution Algorithms for Delivery Problem on Trees
نویسندگان
چکیده
منابع مشابه
Optimal Algorithms for Packet Routing on Trees
In this paper, we study the permutation packet routing problem on trees. We show that every permutation can be routed on a tree of n vertices in n 1 routing steps. We provide an algorithm which produces in O(n) time a schedule that needs O(n) bits for its description. Moreover, we describe an on-line algorithm that completes the routing of any permutation in n 1 routing steps by using at each v...
متن کاملAlgorithms for distributed solution of the Optimal Power Flow problem
Modern power networks often have partitioned structures, with disjoint parts of the network being operated by competing agents. It is therefore of significant interest to be able to solve the Optimal Power Flow (OPF) problem for the entire network in a distributed manner without requiring significant exchange of sensitive operational information between rival operators. For networks whose regio...
متن کاملA New Approach for Finding an Optimal Solution for Grey Transportation Problem
In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...
متن کاملSolution algorithms for a deterministic replacement problem
We consider the life of a k-series system with n-k standbys, which are to replace the working items as they fail in a specified order. Also the life of each item is assumed to be known. The problem is to find the first k elements to be used in the system to start with and the sequence in which replacements are to be made such that the system life is maximized. It is pointed out that this proble...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2014
ISSN: 1598-849X
DOI: 10.9708/jksci.2014.19.2.143